Harrington’s results on arithmetical singletons
نویسنده
چکیده
We exposit two previously unpublished results due to Leo Harrington. The first result says that there exist arithmetical singletons which are arithmetically incomparable. The second result says that there exists a ranked point which is not an arithmetical singleton.
منابع مشابه
The Minimal System of Higher Order Arithmetic to Show That Harrington’s Principle Implies 0 Exists
We let Harrington’s Principle, HP, denote the statement that there is a real x such that every x–admissible ordinal is a cardinal in L. Harrington’s proof of “Det(Σ1) implies 0 ] exists” in ZF is done in two steps: first show that Det(Σ1) implies HP and secondly show that HP implies 0 ] exists. We observe that the first step is provable in Z2. In this paper we prove via class forcing that Z2 + ...
متن کاملAnalytic determinacy and 0# A forcing-free proof of Harrington’s theorem
We prove the following theorem: Given a ⊆ ω and 1 ≤ α < ωCK 1 , if for some η < א1 and all u ∈ WO of length η, a is Σα(u), then a is Σα. We use this result to give a new, forcing-free, proof of Leo Harrington’s theorem: Σ1-Turing-determinacy implies the existence of 0#. A major step in delineating the precise connections between large cardinals and game-determinacy hypotheses is the well-known ...
متن کاملHarrington's conservation theorem redone
Leo Harrington showed that the second-order theory of arithmetic WKL0 is Π 1 -conservative over the theory RCA0. Harrington’s proof is modeltheoretic, making use of a forcing argument. A purely proof-theoretic proof, avoiding forcing, has been eluding the efforts of researchers. In this short paper, we present a proof of Harrington’s result using a cut-elimination argument.
متن کاملHarrington's Principle in Higher order Arithmetic
Let Z2, Z3, and Z4 denote 2nd, 3rd, and 4th order arithmetic, respectively. We let Harrington’s Principle, HP, denote the statement that there is a real x such that every x–admissible ordinal is a cardinal in L. The known proofs of Harrington’s theorem “Det(Σ1) implies 0 ] exists” are done in two steps: first show that Det(Σ1) implies HP, and then show that HP implies 0] exists. The first step ...
متن کاملOn the Connecting Thickness of Arithmetical Discrete Planes
While connected rational arithmetical discrete lines and connected rational arithmetical discrete planes are entirely characterized, only partial results exist for the irrational arithmetical discrete planes. In the present paper, we focus on the connectedness of irrational arithmetical discrete planes, namely the arithmetical discrete planes with a normal vector of which the coordinates are no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012